منابع مشابه
Efficient and Perfect domination on circular-arc graphs
Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ′ ⊆ V (G) such that each vertex v ∈ V (G) \ V ′ is dominated by exactly one vertex v ∈ V . An efficient dominating set is a perfect dominating set V ′ where V ′ is also an independent set. These problems are usually posed in terms of edges instead of vertices. Both problems, either for the vertex or edge variant, remain...
متن کاملPaired domination on interval and circular-arc graphs
We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m + n) time algorithm to solve the paired-domination problem on interval graphs. The result is extended to solve the paired-domination problem on circular-arc graphs in O(m(m+ n)) time. MSC: 05C69, 05C85, 68Q25, 68R10, 68W05
متن کاملLinear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs
In a graph G, a vertex subset S ⊆ V (G) is said to be a dominating set of G if every vertex not in S is adjacent to a vertex in S. A dominating set S of a graph G is called a paired-dominating set if the induced subgraph G[S] contains a perfect matching. The paired-domination problem involves finding a smallest paired-dominating set of G. Given an intersection model of an interval graph G with ...
متن کاملIrredundancy in Circular Arc Graphs
Golumbic, M.C. and R.C. Laskar, Irredundancy in circular arc graphs, Discrete Applied Mathematics 44 (1993) 79-89. A set ofvertices Xis called irredundant if for every x in Xthe closed neighborhood N[x] contains a vertex which is not a member of N[X-x], the union of the closed neighborhoods of the other vertices. In this paper we show that for circular arc graphs the size of the maximum irredun...
متن کاملBoxicity of Circular Arc Graphs
A k-dimensional box is the cartesian product R1 ×R2 × · · · ×Rk where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes: that is two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9599-x